Probabilistic Process Algebra to Unifying Quantum and Classical Computing in Closed Systems

نویسنده

  • Yong Wang
چکیده

We have unified quantum and classical computing in open quantum systems called qACP which is a quantum generalization of process algebra ACP. But, an axiomatization for quantum and classical processes with an assumption of closed quantum systems is still missing. For closed quantum systems, unitary operator, quantum measurement and quantum entanglement are three basic components for quantum computing. This leads to probability unavoidable. Along the solution of qACP to unify quantum and classical computing in open quantum systems, we unify quantum and classical computing with an assumption of closed systems under the framework of ACP-like probabilistic process algebra. This unification make it can be used widely in verification for quantum and classical computing mixed systems, such as most quantum communication protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration 〈p, %〉, but we treat it as two relative independent part: the structural part p and the quantum part %, because the establishment of a sound and complete theory is dependent on the structural ...

متن کامل

4 Quantum Algorithms : Applicable Algebra and Quantum Physics

Classical computer science relies on the concept of Turing machines as a unifying model of universal computation. According to the modern Church– Turing Thesis, this concept is interpreted in the form that every physically reasonable model of computation can be efficiently simulated on a probabilistic Turing machine. Recently this understanding, which was taken for granted for a long time, has ...

متن کامل

Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources

An algorithm is outlined for deciding the correctness of (space and time) resource bounded, imperative, probabilistic programs, using linear algebra techniques encoded in the theory of real closed fields. A calculus suitable for reasoning by hand is derived from the proposed encoding. The approach is feasible also for classical, non deterministic, and quantum programs.

متن کامل

Providing a Bird Swarm Algorithm based on Classical Conditioning Learning Behavior and Comparing this Algorithm with sinDE, JOA, NPSO and D-PSO-C Based on Using in Nanoscience

There can be no doubt that nanotechnology will play a major role in our futuretechnology. Computer science offers more opportunities for quantum andnanotechnology systems. Soft Computing techniques such as swarm intelligence, canenable systems with desirable emergent properties. Optimization is an important anddecisive activity in structural designing. The inexpensive re...

متن کامل

Classical wavelet systems over finite fields

This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1610.02500  شماره 

صفحات  -

تاریخ انتشار 2016